A parallel direct solver for large sparse highly unsymmetric linear systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parallel row projection solver for large sparse linear systems

In this paper we present a parallel iterative solver for large and sparse nonsymmetric linear systems. The solver is based on a row-projection algorithm, derived from the symmetrized block version of the Kacz-marz method with Conjugate Gradient acceleration. A comparison with some h'rylov subspace methods shows the remarkable robustness of this algorithm when applied to systems with eingevalues...

متن کامل

Parallel IQMR Method for Unsymmetric Large and Sparse Linear Systems in Computational Fluid Dynamics

| We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) method 20], 21] for the solutions of linear systems of equations with unsymmetric coeecient matrices arising from the discretization of uid dynamic problems on massively parallel distributed memory computers. We will deal with implicit nite diierence schemes for solving the Euler equations. These sc...

متن کامل

a new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot

abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...

15 صفحه اول

A Large-Grain Parallel Sparse System Solver

The eeciency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning. A new algorithm which produces this fo...

متن کامل

A Parallel Unsymmetric Inverse Iteration Solver

We describe a matrix multiply based block unsymmetric inverse iteration solver for upper Hessenberg matrices. Our kernel is robust in that it prevents overrow by scaling. It uses new techniques to ensure performance is not sacriiced when scaling is not necessary. Finally, we give results on a parallel implementation on an Intel Paragon TM supercomputer.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Mathematical Software

سال: 2004

ISSN: 0098-3500,1557-7295

DOI: 10.1145/992200.992201